Maximum likelihood amplitude scale estimation for quantization-based watermarking in the presence of dither
نویسندگان
چکیده
Quantization-based watermarking schemes comprise a class of watermarking schemes that achieves the channel capacity in terms of additive noise attacks. The existence of good high dimensional lattices that can be efficiently implemented and incorporated into watermarking structures, made quantization-based watermarking schemes of practical interest. Because of the structure of the lattices, watermarking schemes making use of them are vulnerable to non-additive operations, like amplitude scaling in combination with additive noise. In this paper, we propose a secure Maximum Likelihood (ML) estimation technique for amplitude scaling factors using subtractive dither. The dither has mainly security purposes and is assumed to be known to the watermark encoder and decoder. We derive the probability density function (PDF) models of the watermarked and attacked data in the presence of subtractive dither. The derivation of these models follows the lines of, where we derived the PDF models in the absence of dither. We derive conditions for the dither sequence statistics such that a given security level is achieved using the error probability of the watermarking system as objective function. Based on these conditions we are able to make approximations to the PDF models that are used in the ML estimation procedure. Finally, experiments are performed with real audio and speech signals showing the good performance of the proposed estimation technique under realistic conditions.
منابع مشابه
Iterative estimation of amplitude scaling on distortion-compensated dither modulation
The vulnerability of quantization-based data hiding schemes to amplitude scaling requires the formulation of countermeasures to this relatively simple attack. Parameter estimation is one possible approach, where the applied scaling is estimated from the received signal at the decoder. This estimate can be used to correct the mismatch with respect to the quantization step assumed by the decoder ...
متن کاملQuantization-Based Watermarking: Methods for Amplitude Scale Estimation, Security, and Linear Filtering Invariance
Watermarking is the process of imperceptibly embedding a message (watermark) into a host signal (audio, video). The resulting signal is called a watermarked signal. The message should introduce only tolerable distortion to the host signal and it should be recoverable by the intended receiver after signal processing operations on the watermarked data. Watermarking schemes based on quantization t...
متن کاملStatistical amplitude scale estimation for quantization-based watermarking
Quantization-based watermarking schemes are vulnerable to amplitude scaling. Therefore the scaling factor has to be accounted for either at the encoder, or at the decoder, prior to watermark decoding. In this paper we derive the marginal probability density model for the watermarked and attacked data, when the attack channel consists of amplitude scaling followed by additive noise. The encoder ...
متن کاملScale estimation in two-band filter attacks on QIM watermarks
This paper presents a scheme for estimating two-band amplitude scale attack within a quantization-based watermarking context. Quantization-based watermarking schemes comprise a class of watermarking schemes that achieves the channel capacity in terms of additive noise attacks. Unfortunately, Quantization-based watermarking schemes are not robust against Linear Time Invariant (LTI) filtering att...
متن کاملOptimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling
This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...
متن کامل